A Replica Management Protocol in a Binary Balanced Tree Structure-Based P2P Network
نویسندگان
چکیده
The purpose of our work is to realize a load balancing of nodes in a P2P network. A replica management protocol, which exploits replicas for balancing loads of each node managing popular data, by adapting replica partition trees to a balanced tree overlay network called BATON, for BAlanced Tree Overlay Network, is proposed for this. BATON has a load balancing mechanism where each node adjusts the number of data managed by it. However, if there are some popular data that are accessed by a large number of nodes in a network, the mechanism of BATON could fail. We propose a replica management protocol for balancing loads of both data transmission and replica management of each node. Some results of simulation in which our proposal was compared with a method without replica and another method of simple replica management are showed and the effective and weak points of our proposal are discussed.
منابع مشابه
Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages
Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...
متن کاملP2P Replica-tree based Consistency Maintenance Strategy
Replica consistency maintenance plays a key role to improve the efficiency of replica management. This paper proposed one P2P Replica-tree based consistency maintenance strategy. In this strategy, social capacity is adopted for description of replica clustering coefficient, and one replica-tree is formed by dividing replica nodes into multi-levels. Especially peer-to-peer network with first-cla...
متن کاملEfficient Search in Structured Peer-to-Peer Systems: Binary v.s. k-ary Unbalanced Tree Structures
We investigate the search cost in terms of number of messages generated for routing queries in tree-based P2P structured systems including binary and k-ary tree structures with different arities and different degrees of imbalance in the tree shape. This work is motivated by the fact that k-ary balanced tree access structures can greatly reduce the number of hops for searching compared to the bi...
متن کاملIntelligent identification of vehicle’s dynamics based on local model network
This paper proposes an intelligent approach for dynamic identification of the vehicles. The proposed approach is based on the data-driven identification and uses a high-performance local model network (LMN) for estimation of the vehicle’s longitudinal velocity, lateral acceleration and yaw rate. The proposed LMN requires no pre-defined standard vehicle model and uses measurement data to identif...
متن کاملHardness of Virtual Network Embedding with Replica Selection
Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. This assumption is justified by many realworld implementations of datacenters. We consider an extension to virtual cluster embedding by introducing replication among data chunks. In many real-world applications, data i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 4 شماره
صفحات -
تاریخ انتشار 2009